/*
 Problem Description
Given a sequence 1,2,3,......N, your job is to calculate all the possible sub-sequences that the sum of the sub-sequence is M.
 

Input
Input contains multiple test cases. each case contains two integers N, M( 1 <= N, M <= 1000000000).input ends with N = M = 0.

 

Output
For each test case, print all the possible sub-sequence that its sum is M.The format is show in the sample below.print a blank line after each test case.

 

Sample Input
20 10
50 30
0 0
 

Sample Output
[1,4]
[10,10]

[4,8]
[6,9]
[9,11]
[30,30]

 */
package com.yuan.algorithms.acm201504;

import java.util.Scanner;

public class HD2058数列求和查找 {

	public static void main(String[] args) {
		Scanner sc =new Scanner(System.in);
		while(sc.hasNext()) {
			long n = sc.nextLong();
			long m = sc.nextLong();
			if (n==0 && m==0) {
				break;
			}
			long start = 0, end = 0;
			for (long i = 1; i <= n; i++) {
				long sum = 0;
				start = i;end = 0;
				for (long j = i; j <= n; j++) {
					sum += j;
					if (sum>m) {
						break;
					}else if (sum==m) {
						end = j;
						break;
					}
				}
				if (start!=0 && end!=0) {
					System.out.println("["+start+","+end+"]");
				}
			}
			System.out.println();
		}

	}

}
